The average-cost formulation of lot sizing models and inventory carrying charges: a technical note
نویسندگان
چکیده
منابع مشابه
Lot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one in which stock is not conserved. That is, the stock in inventory undergoes a transformation in each period that is independent of the period in which the item was produced. A 0 1 mixed integer programming formulation o...
متن کاملTechnical Note - Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
Ravindra K. Ahuja and Dorit S. Hochbaum Abstract In this paper, we study capacitated dynamic lot sizing problems with or without backorders, under the assumption that production costs are linear, that is, there are no set up costs. These two dynamic lot sizing problems (with or without backorders) are minimum cost flow problems on an underlying network that possess a special structure. We show ...
متن کاملA Note on "Lot-sizing with fixed charges on stocks: The convex hull"
We update and complete the proof of Proposition 7 in Van Vyve and Ortega (2004), which states that the projection of a facility location reformulation of an uncapacitated lot sizing problem with fixed charges on stocks (ULSW) to the original space is equivalent to that of the tight shortest path reformulation of ULSW. Their proof is interesting and consists of two cases, only first of which is ...
متن کاملApproximation Algorithms for Capacitated Stochastic Lot-sizing Inventory Control Models
Introduction. We study a class of capacitated stochastic lot-sizing inventory control problems with stochastic, non-stationary and correlated demands that evolve over time. Economies of scale and capacity constraints exist in many practical scenarios. However, models with fixed ordering costs and capacity constraints are typically computationally intractable, and even the structure of the optim...
متن کاملA note on "The economic lot sizing problem with inventory bounds"
In a recent paper, Liu (2008) considers the lot-sizing problem with lower and upper bounds on the inventory levels. He proposes an O(n2) algorithm for the general problem, and an O(n) algorithm for the special case with non-speculative motives. We show that neither of the algorithms provides an optimal solution in general. Furthermore, we propose a fix for the former algorithm that maintains th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Management Research
سال: 2021
ISSN: 1936-9735,1936-9743
DOI: 10.1007/s12063-021-00191-2